Notes on the History of Fork and Join
نویسندگان
چکیده
As part of a PhD on code forking in open source software, Linus Nyman looked into the origins of how the practice came to be called forking. This search led to the early history of the fork system call. Having not previously seen such a history published, here we look back at the birth of the fork system call to share what was learned, as remembered by its pioneers. The fork call allows a process (or running program) to create new processes. The original is deemed the parent process, and the newly created one its child. On multiprocessor systems, these processes can run concurrently in parallel. Since its birth 50 years ago, the fork has remained a central element of modern computing, both with regard to software development principles and, by extension, to hardware design, which increasingly accommodates parallelism in process execution.
منابع مشابه
Dynamic Subtask Dispersion Reduction in Heterogeneous Parallel Queueing Systems
Fork-join and split-merge queueing systems are mathematical abstractions of parallel task processing systems in which entering tasks are split into N subtasks which are served by a set of heterogeneous servers. The original task is considered completed once all the subtasks associated with it have been serviced. Performance of split-merge and fork-join systems are often quantified with respect ...
متن کاملNotes on some remarkable epiphytic lichens from Mazandaran province and a short history of lichenology in the Hyrcanian forest, N Iran
Nineteen species of mostly epiphytic lichens from the forests of Nowshahr and Royan located in Mazandaran province (N Iran) are reported. Three species, Ochrolechia pallescens, Phaeophyscia confusa and Usnea longissima, are newly reported for lichenized mycota of Iran and seven species are new to the province. Additionally, a short history of lichenological exploration in the Hyrcanian forest i...
متن کاملResponse Time Approximations in Fork-Join Queues
Fork-join queueing networks model a network of parallel servers in which an arriving job splits into a number of subtasks that are serviced in parallel. Fork-join queues can be used to model disk arrays. A response time approximation of the fork-join queue is presented that attempts to comply with the additional constraints of modelling a disk array. This approximation is compared with existing...
متن کاملNon-Asymptotic Delay Bounds for Multi-Server Systems with Synchronization Constraints
Multi-server systems have received increasing attention with important implementations such as Google MapReduce, Hadoop, and Spark. Common to these systems are a fork operation, where jobs are first divided into tasks that are processed in parallel, and a later join operation, where completed tasks wait until the results of all tasks of a job can be combined and the job leaves the system. The s...
متن کاملTwo Moment Approximations for Fork/Join Stations with Applications to Modeling Kanban Systems
In queuing models of kanban systems, fork/join stations are used to model the synchronization constraints between parts and kanbans. Efficient analysis of these fork/join stations is quite crucial to analytical performance evaluation of kanban systems. Exact analysis of the fork/join station can be difficult especially if the input processes have general characteristics. We propose a new method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Annals of the History of Computing
دوره 38 شماره
صفحات -
تاریخ انتشار 2016